Short-term performance management by priority-based queueing
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Priority Queueing Systems in Discrete Time
The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-prior...
متن کاملRate-Controlled Static-Priority Queueing
We propose a new service discipline, called the RateControlled Static-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies t...
متن کاملTraffic Management and Security Based on Priority Queueing and Multicore Firewall Implementation
We consider the telematics appliances, such as firewall, as a basic part of security system with specific preemptive priority queuing and access control algorithm oriented on multi-core implementation. Proposed randomized push-out buffer management mechanism with α parameter allows tuning very efficiently the loss probability of priority packets and the time they spend in queue as the factors u...
متن کاملPriority Based Wavelength Routed WDM Networks: A Queueing Theory Approach
: The present paper proposes a new model for priority assignment to the incoming call connection request for all optical WDM communication, adopting standard queuing theory concept. The model has been proposed for three different levels of call connection priorities, categorizing them into three types of signals as type0, type1 and type2 according to increasing priority, and generation probabil...
متن کاملPer-flow guarantees under class-based priority queueing
In this paper, we present an admission control scheme which provides per-flow delay and bandwidth guarantees based solely upon simple class-based strict priority queue-ing. We derive basic properties of the worst-case behaviour in strict priority queueing systems using network calculus. Building upon these properties the flow admission control scheme is devised. The rationale behind this work i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Service Oriented Computing and Applications
سال: 2010
ISSN: 1863-2386,1863-2394
DOI: 10.1007/s11761-010-0066-3